منابع مشابه
A Relative Laplacian Spectral Recursion
The Laplacian spectral recursion, satisfied by matroid complexes and shifted complexes, expresses the eigenvalues of the combinatorial Laplacian of a simplicial complex in terms of its deletion and contraction with respect to vertex e, and the relative simplicial pair of the deletion modulo the contraction. We generalize this recursion to relative simplicial pairs, which we interpret as convex ...
متن کاملA General Form of Relative Recursion
The purpose of this note is to observe a generalization of the concept “computable in. . . ” to arbitrary partial combinatory algebras. For every partial combinatory algebra (pca) A and every partial endofunction on A, a pca A[f ] is constructed such that in A[f ], the function f is representable by an element; a universal property of the construction is formulated in terms of Longley’s 2-categ...
متن کاملTopological Recursion for Irregular Spectral Curves
We study topological recursion on the irregular spectral curve xy2 − xy + 1 = 0, which produces a weighted count of dessins d’enfant. This analysis is then applied to topological recursion on the spectral curve xy2 = 1, which takes the place of the Airy curve x = y2 to describe asymptotic behaviour of enumerative problems associated to irregular spectral curves. In particular, we calculate all ...
متن کاملSigned Laplacian for spectral clustering revisited
Classical spectral clustering is based on a spectral decomposition of a graph Laplacian, obtained from a graph adjacency matrix representing positive graph edge weights describing similarities of graph vertices. In signed graphs, the graph edge weights can be negative to describe disparities of graph vertices, for example, negative correlations in the data. Negative weights lead to possible neg...
متن کاملSpectral projections for the twisted Laplacian
Let n ≥ 1, d = 2n, (x, y) ∈ Rn ×Rn the notation for a generic point in R2n. The twisted Laplacian L = − 2 n
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1883